#pragma once
#include"RBTree.h"
namespace MoYu
{
	template<class K>
	class set
	{
	private:
		struct SetOfT
		{
			const K& operator()(const K& x)
			{
				return x;
			}
		};
	private:
		RBTree<K, const K , SetOfT> _root;
	public:
		typedef typename RBTree<K , const K , SetOfT>::Iterator iterator;
		typedef typename RBTree<K , const K , SetOfT>::Const_Iterator const_iterator;
		iterator begin()
		{
			return _root.Begin();
		}
		iterator end()
		{
			return _root.End();
		}
		pair<iterator, bool> insert(const K& val)
		{
			return _root.insert(val);
		}
		iterator find(const K& key)
		{
			return _root.Find(key);
		}
	};
}
